package win.bigwhale.defense;

import java.awt.Point;
import java.util.ArrayList;

public class MonsterPath {
	private ArrayList<Point> path = new ArrayList<Point>();
	private int currentPosition;
	
	public MonsterPath(Point[] points) {
		for (int i = 0; i < points.length; i++) {
			path.add(points[i]);
		}
		
		currentPosition = 0;
	}
	
	public Point moveNext() {
		++ currentPosition;
		if (currentPosition < path.size()) {
			return path.get(currentPosition);
		}
		
		return null;
	}
	
	public Point initPosition() {
		return path.get(0);
	}
	
	public void printPath() {
		for (Point point : path) {
			System.out.println(point.toString());
		}
	}
}
